Precomplete Clones on Infinite Sets Which Are Closed under Conjugation

نویسنده

  • MICHAEL PINSKER
چکیده

We show that on an infinite set, there exist no other precomplete clones closed under conjugation except those which contain all permutations. Since on base sets of some infinite cardinalities, in particular on countably infinite ones, the precomplete clones containing the permutations have been determined, this yields a complete list of the precomplete conjugation-closed clones in those cases. In addition, we show that there exist no precomplete submonoids of the full transformation monoid which are closed under conjugation except those which contain the permutations; the monoids of the latter kind are known. 1. Background and the result Let X be a set and denote for all n ≥ 1 the set of n-ary operations on X by O. The union O = ⋃ n≥1 O (n) is the set of all operations on X of finite arity. A clone is a subset of O which contains all projections, i.e. all functions of the form π k (x1, . . . , xn) = xk (1 ≤ k ≤ n), and which is closed under composition of functions. Ordering the clones on X by set-theoretical inclusion, one obtains a complete algebraic lattice Cl(X). We are interested in the structure of this lattice for infinite X , in which case it has cardinality 2 |X| . We call a clone precomplete or maximal iff it is a dual atom in Cl(X). The number of precomplete clones on an infinite base set equals the size of the whole clone lattice ([15]), and there is little hope to determine all of them. However, the precomplete clones which contain O have been determined on some infinite X ([2], [5]). Theorem 1. If X is countably infinite or of weakly compact cardinality, then there are exactly two precomplete clones Pol(T1) and Pol(T2) above O . For most other cardinalities of X , the number of precomplete clones above O is 2 |X| , so in those cases it seems impossible to find them all ([5]). The precomplete clones which contain the set of permutations S of the base set but not O have been determined on countably infinite X in [6], and we extended this result to all X of regular cardinality in [13]. To describe these clones, the following concept was used: For a submonoid G ⊆ O, define the clone of 1991 Mathematics Subject Classification. Primary 08A40; secondary 08A05.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Number of Unary Clones Containing the Permutations on an Infinite Set

We calculate the number of unary clones (submonoids of the full transformation monoid) containing the permutations, on an infinite base set. It turns out that this number is quite large, sometimes as large as the whole clone lattice. 1. Background and the result Fix a set X and consider for all n ≥ 1 the set O(n) of n-ary operations on X. If we take the union O = ⋃ n≥1 O (n) over these sets, we...

متن کامل

Ideal Clones: Solution to a Problem of Czédli and Heindorf

Given an infinite set X and an ideal I of subsets of X, the set of all finitary operations on X which map all (powers of) I-small sets to I-small sets is a clone. In [CH01], G. Czédli and L. Heindorf asked whether or not for two particular ideals I and J on a countably infinite set X, the corresponding ideal clones were a covering in the lattice of clones. We give an affirmative answer to this ...

متن کامل

Clones on Regular Cardinals

We investigate the structure of the lattice of clones on an infinite set X . We first observe that ultrafilters naturally induce clones; this yields a simple proof of Rosenberg’s theorem: there are 2 λ many maximal (= “precomplete”) clones on a set of size λ. The clones we construct do not contain all unary functions. We then investigate clones that do contain all unary functions. Using a stron...

متن کامل

The Minimal Clones above the Permutations

We determine the atoms of the interval of the clone lattice consisting of those clones which contain all permutations, on an infinite base set. This is equivalent to the description of the atoms of the lattice of transformation monoids above the permutations. 1. The problem and the result Let X be an infinite set of cardinality κ = אα, let O be the set of all finitary operations on X, and for a...

متن کامل

Maximal Clones on Uncountable Sets That Include All Permutations

We first determine the maximal clones on a set X of infinite regular cardinality κ which contain all permutations but not all unary functions, extending a result of Heindorf’s for countably infinite X. If κ is countably infinite or weakly compact, this yields a list of all maximal clones containing the permutations since in that case the maximal clones above the unary functions are known. We th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005